A Relationship Between Thomassen's Conjecture and Bondy's Conjecture
نویسندگان
چکیده
In 1986, Thomassen posed the following conjecture: every 4-connected line graph has a Hamiltonian cycle. As a possible approach to the conjecture, many researchers have considered statements that are equivalent or related to it. One ∗Email address: [email protected] Research partly supported by project P202/12/G061 of the Czech Science Foundation and by the European Regional Development Fund (ERDF), project NTIS New Technologies for Information Society, European Centre of Excellence, CZ.1.05/1.1.00/02.0090. †Email address: [email protected] This work was supported by JSPS KAKENHI Grant Number 26800083. ‡Email address: [email protected] This work was supported by JSPS KAKENHI Grant Number 25871053. §Email address: [email protected] Research partly supported by project P202/12/G061 of the Czech Science Foundation and by the European Regional Development Fund (ERDF), project NTIS New Technologies for Information Society, European Centre of Excellence, CZ.1.05/1.1.00/02.0090. ¶Email address: [email protected] This work was supported by JSPS KAKENHI Grant Number 22540152.
منابع مشابه
Frankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملThe Auslander-Reiten Conjecture for Group Rings
This paper studies the vanishing of $Ext$ modules over group rings. Let $R$ be a commutative noetherian ring and $ga$ a group. We provide a criterion under which the vanishing of self extensions of a finitely generated $Rga$-module $M$ forces it to be projective. Using this result, it is shown that $Rga$ satisfies the Auslander-Reiten conjecture, whenever $R$ has finite global dimension and $ga...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملOn some generalisations of Brown's conjecture
Let $P$ be a complex polynomial of the form $P(z)=zdisplaystyleprod_{k=1}^{n-1}(z-z_{k})$,where $|z_k|ge 1,1le kle n-1$ then $ P^prime(z)ne 0$. If $|z|
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 29 شماره
صفحات -
تاریخ انتشار 2015